Analyzing Walksat on Random Formulas
نویسندگان
چکیده
منابع مشابه
Analyzing Walksat on Random Formulas
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from Papadimitriou (FOCS 1991)/Schöning (FOCS 1999) finds a satisfying assignment of Φ in polynomial time w.h.p. if m/n ≤ ρ · 2/k for a certain constant ρ > 0. This is an improvement by a factor of Θ(k) over the best previous analysis of Walksat from Coja-Oghlan, Feige, Frie...
متن کاملOn smoothed k-CNF formulas and the Walksat algorithm
In this paper we study the model of ε-smoothed k-CNF formulas. Starting from an arbitrary instance F with n variables and m = dn clauses, apply the ε-smoothing operation of flipping the polarity of every literal in every clause independently at random with probability ε. Keeping ε and k fixed, and letting the density d = m/n grow, it is rather easy to see that for d ≥ ε−k ln 2, F becomes whp un...
متن کاملImproving WalkSAT for Random k-Satisfiability Problem with k > 3
Stochastic local search (SLS) algorithms are well known for their ability to efficiently find models of random instances of the Boolean satisfiablity (SAT) problem. One of the most famous SLS algorithms for SAT is WalkSAT, which is an initial algorithm that has wide influence among modern SLS algorithms. Recently, there has been increasing interest in WalkSAT, due to the discovery of its great ...
متن کاملThreshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability
An important heuristic in local search algorithms for Satisfiability is focusing, i.e. restricting the selection of flipped variables to those appearing in presently unsatisfied clauses. We consider the behaviour on large randomly generated 3-SAT instances of two focused solution methods: the well-known WalkSAT algorithm, and the straightforward algorithm obtained by imposing the focusing const...
متن کاملRedundancy in Random SAT Formulas
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the performances measured on a large number of random instances. The size of these instances is, in general, small to get these experiments done in reasonable time. This assumes that the small size formulas have the same ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2014
ISSN: 0097-5397,1095-7111
DOI: 10.1137/12090191x